Coloring in Sublinear Time
نویسندگان
چکیده
We will present an algorithm, based on SA-techniques and a sampling procedure, that colors a given random 3-colorable graph with high probability in sublinear time. This result is the rst theoretical justiication of many excellent experimental performance results of Simulated Annealing 10, 17] applied to graph coloring problems.
منابع مشابه
Sublinear graph augmentation for fast query implementation
We introduce the problem of augmenting graphs with sublinear memory in order to speed up replies to queries. As a concrete example, we focus on the following problem: the input is an (unpartitioned) bipartite graph G = (V,E). Given a query v ∈ V , the algorithm’s goal is to output v’s color in some legal 2-coloring of G, using few probes to the graph. All replies have to be consistent with the ...
متن کاملAn on-line graph coloring algorithm with sublinear performance ratio
One of the simplest heuristics for obtaining a proper coloring of a graph is the Fii-Fit algorithm: Fix an arbitrary ordering of the vertices and, using the positive integers as the color set, assign to each successive vertex the least integer possible (keeping the coloring proper). This is an example of an on-line algorithm for graph coloring. In the on-line model, a graph is presented one ver...
متن کاملSublinear time algorithms in the theory of groups and semigroups
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a small portion of the input. The most typical situation where sublinear time algorithms are considered is property testing. There are several interesting contexts where one can test properties in sublinear time. A canonical example is graph colorability. To...
متن کاملApproximate Hypergraph Coloring
A coloring of a hypergraph is a mapping of vertices to colors such that no hyperedge is monochromatic. We are interested in the problem of coloring 2-colorable hypergraphs. For the special case of graphs (hypergraphs of dimension 2) this can easily be done in linear time. The problem for general hypergraphs is much more difficult since a result of Lovász implies that the problem is NP-hard even...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کامل